Searchable Encryption Supporting General Boolean Expression Queries
نویسندگان
چکیده
BSSE algorithms Each keyword is considered as a vector in order to perform inner product during the search phase. Boolean symmetric searchable encryption BSSE is mainly based on the orthogonalization of the keyword field according to the GramSchmidt process. Searchable encryption: Searching encrypted keywords using encrypted queries (trapdoor) in order to retrieve encrypted documents without any leak of information of the content of queries and documents.
منابع مشابه
SESOS: A Verifiable Searchable Outsourcing Scheme for Ordered Structured Data in Cloud Computing
While cloud computing is growing at a remarkable speed, privacy issues are far from being solved. One way to diminish privacy concerns is to store data on the cloud in encrypted form. However, encryption often hinders useful computation cloud services. A theoretical approach is to employ the so-called fully homomorphic encryption, yet the overhead is so high that it is not considered a viable s...
متن کاملSubstring Position Search over Encrypted Cloud Data Supporting Efficient Multi-User Setup
Existing Searchable Encryption (SE) solutions are able to handle simple Boolean search queries, such as single or multi-keyword queries, but cannot handle substring search queries over encrypted data that also involve identifying the position of the substring within the document. These types of queries are relevant in areas such as searching DNA data. In this paper, we propose a tree-based Subs...
متن کاملFuzzy retrieval of encrypted data by multi-purpose data-structures
The growing amount of information that has arisen from emerging technologies has caused organizations to face challenges in maintaining and managing their information. Expanding hardware, human resources, outsourcing data management, and maintenance an external organization in the form of cloud storage services, are two common approaches to overcome these challenges; The first approach costs of...
متن کاملHighly-Scalable Searchable Symmetric Encryption with Support for Boolean Queries
This work presents the design and analysis of the first searchable symmetric encryption (SSE) protocol that supports conjunctive search and general Boolean queries on outsourced symmetrically-encrypted data and that scales to very large databases and arbitrarily-structured data including free text search. To date, work in this area has focused mainly on single-keyword search. For the case of co...
متن کاملGeneric Adaptively Secure Searchable Phrase Encryption
In recent years searchable symmetric encryption has seen a rapid increase in query expressiveness including keyword, phrase, Boolean, and fuzzy queries. With this expressiveness came increasingly complex constructions. Having these facts in mind, we present an efficient and generic searchable symmetric encryption construction for phrase queries. Our construction is straightforward to implement,...
متن کامل